A note on Baker’s algorithm
نویسندگان
چکیده
We present a corrected version of Baker’s algorithm for finding a minimum dominating set in an l-outerplanar graph.
منابع مشابه
A Comment on the Relationship between Judicial Salary and Judicial Quality
Professor Scott Baker was kind enough to present his empirical research on the relationship between judicial salary and judicial quality1 to the Law and Economics Workshop run by Professor Keith Hylton2 and me last fall and I am honored to be able to comment on it today. It is part of a growing body of literature in law that tries to shed light on important issues through statistical analysis. ...
متن کاملSaccharomyces Cerevisiae as a Biocatalyst for Different Carbonyl Group under Green Condition
In this researchsaccharomyces cerevisiae (baker’s yeast) was used as a cheap, readily accessible, selective, efficient, and green bio-catalyst in a chemo selective reduction of carbonyl group to hydroxyl group. In this green procedure three substrates e.g. (3-(3-nitrophenyl)aziridin-2-yl)-1-phenyl-methanone, pyruvate ester, and 2-acetyl-γ-butyrolactone were r...
متن کاملOn the Quantum Baker’s Map and its Unusual Traces
The quantum baker’s map is the quantization of a simple classically chaotic system, and has many generic features that have been studied over the last few years. While there exists a semiclassical theory of this map, a more rigorous study of the same revealed some unexpected features which indicated that correction terms of the order of log(h̄) had to be included in the periodic orbit sum. Such ...
متن کاملOptimal Operation of Baker’s Yeast Fermenta- tion in the Presence of Uncertainty
In this paper, we consider the problem of determining the optimal feeding policy for a fed-batch fermentation for the production of Baker’s yeast in the presence of uncertainty. Two algorithms are discussed for the computing the optimal solution in the presence of uncertainty. The first method is a measurement-based closed-loop approach where process measurements are utilized to make on-line ad...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004